The Third International Timetabling Competition
نویسندگان
چکیده
This paper is the organizers’ report on the Third International Timetabling Competition (ITC2011), run during the first half of 2012. Its participants tackled 35 instances of the high school timetabling problem, taken from schools in 10 countries.
منابع مشابه
GOAL solver: a hybrid local search based solver for high school timetabling
This work presents a local search approach to the High School Timetabling Problem. The addressed timetabling model is the one stated in the Third International Timetabling Competition (ITC 2011), which considered many instances from educational institutions around the world and attracted seventeen competitors. Our team, named GOAL (Group of Optimization and Algorithms), developed a solver built...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling Track
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening July 22nd). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timeta...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3)
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...
متن کاملVariable Neighborhood Search based algorithms for high school timetabling
This work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC 2011), which released many instances from educational institutions around the world and attracted seventeen competitors. Some of the VNS algorithm variants were ab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 239 شماره
صفحات -
تاریخ انتشار 2016